Benchmarking and optimization of robot motion planning with motion planning pipeline
نویسندگان
چکیده
Abstract Algorithms have been designed for robot motion planning with various adaptability to different problems. However, how choose the most suitable planner in a scene has always problem worthy of research. This paper aims find each query under three scenes and six queries. The work lies optimization sampling-based algorithms through pipeline request adapter. idea is use pre-processing adapter, run OMPL as pre-processer optimized CHOMP or STOMP algorithm, connect pipeline, realize trajectory. trajectories are compared original benchmarking. benchmarking determines algorithm scenarios Experimental results show that after optimization, time longer, but efficiency significantly improved. In low-complexity scenes, optimizes sampling very well, improves trajectory quality greatly, higher success rate. also good it reduces rate algorithm. more complex performance two methods may not be future work, we need better tackle scenes.
منابع مشابه
Mobile Robot Online Motion Planning Using Generalized Voronoi Graphs
In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...
متن کاملRobot motion planning with uncertainty
This thesis concerns robot motion planning with uncertainty in control and sensing. The problem can be formulated, with some approximations, as path-planning in the extended space of poses × covariances. The reduction of uncertainty due to data acquired by exteroceptive sensors is modelled with the use of Fisher’s information matrix. Many optimization problems can be defined in this framework; ...
متن کاملMulti-Robot Motion Planning
We present a simple and natural extension of the multi-robot motion planning problem where the robots are partitioned into groups (colors), such that in each group the robots are interchangeable. Every robot is no longer required to move to a specific target, but rather to some target placement that is assigned to its group. We call this problem k-color multi-robot motion planning and provide a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The International Journal of Advanced Manufacturing Technology
سال: 2021
ISSN: ['1433-3015', '0268-3768']
DOI: https://doi.org/10.1007/s00170-021-07985-5